Large sets of t-designs from t-homogeneous groups
نویسندگان
چکیده
A direct method for constructing large sets of t-designs is based on the concept of assembling orbits of a permutation group G on ksubsets of a v-set into block sets of t-designs so that these designs form a large set. If G is t-homogeneous, then any orbit is a t-design and therefore we obtain a large set by partitioning the set of orbits into parts consisting of the same number of k-subsets. In general, it is hard to find such partitions. We solve this problem when orbit sizes are limited to two values. We then use its corollaries to obtain some results in a special case in which a simple divisibility condition holds and no knowledge about orbit sizes is assumed.
منابع مشابه
A Few More Large Sets of t-Designs
We construct several new large sets of t-designs that are invariant under Frobenius groups, and discuss their consequences. These large sets give rise to further new large sets by means of known recursive constructions including an infinite family of large sets of 3− (v, 4, λ) designs. c © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 293–308, 1998
متن کاملSome t-Homogeneous Sets of Permutations
Perpendicular Arrays are ordered combinatorial structures, which recently have found applications in cryptography. A fundamental construction uses as ingredients combinatorial designs and uniformly t-homogeneous sets of permutations. We study the latter type of objects. These may also be viewed as generalizations of t-homogeneous groups of permutations. Several construction techniques are given...
متن کاملBlock Transitive Resolutions of t - designs andRoom
By a resolution of t-designs we mean a partition of the trivial design ? X k of all k-subsets of a v-set X into t ? (v 0 ; k;) designs, where v 0 v. A resolution of t-designs with v = v 0 is also called a large set of t-designs. A Room rectangle R, based on ? X k , is a rectangular array whose non-empty entries are k-sets. This array has the further property that taken together the rows form a ...
متن کاملTRANSITIVE t - DESIGNS AND STRONGLY REGULAR GRAPHS CONSTRUCTED FROM LINEAR GROUPS L ( 2 , q ) , q ≤ 23
In this paper we construct transitive t-designs from the linear groups L(2, q), q ≤ 23. Thereby we classify t-designs, t ≥ 2, admitting a transitive action of the linear groups L(2, q), q ≤ 23, up to 35 points and obtained numerous transitive designs, for 36 ≤ v ≤ 55. In many cases we proved the existence of t-designs with certain parameter sets. Among others we constructed t-designs with param...
متن کاملLARGE SETS OF t−DESIGNS FROM GROUPS
This paper addresses questions related to the existence and construction of large sets of t-(v, k, λ) designs. It contains material from my talk in the Combinatorial Designs Conference in honor of Alex Rosa’s 70th birthday, which took place in beautiful Bratislava, in July, 2007. Naturally, only a small number of “highlight” topics could be included, and for the most part these involve the use ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 97 شماره
صفحات -
تاریخ انتشار 2010